Construction of SLAM Algorithm for Window Cleaning Robot Moving Along Window Frame

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

VSMURF: A Novel Sliding Window Cleaning Algorithm for RFID Networks

Radio Frequency Identification (RFID) is one of the key technologies of the Internet ofThings (IoT) and is used inmany areas, such asmobile payments, public transportation, smart lock, and environment protection. However, the performance of RFID equipment can be easily affected by the surrounding environment, such as electronic productions and metal appliances. These can impose an impact on the...

متن کامل

A Sliding Window Filter for SLAM

This note describes a Sliding Window Filter that is an on-line constanttime approximation to the feature-based 6-degree-of-freedom full Batch Least Squares Simultaneous Localization and Mapping (SLAM) problem. We contend that for SLAM to be useful in large environments and over extensive run-times, its computational time complexity must be constant, and its memory requirements should be at most...

متن کامل

Occupational hazards in window cleaning.

Accidental falls involving window cleaners treated at the Middlesex Hospital over five years are reviewed. Failure to use safety belts and the lack of suitable anchorage points were contributary factors in all 20 patients. The use of protective equipment and the provision of anchorage points should be enforced. While the doctor's duty is to treat injuries he also has the opportunity to draw att...

متن کامل

Moving Time Window Aggregates

Moving window concepts are used in temporal query languages for aggregate functions over the dimension ‘time’. In the medical domain, aggregation of patient data over time windows builds a powerful mechanism within clinical database queries to satisfy a class of typical medical question formulations. In opposite to other fields, like the business domain for example, there is the additional need...

متن کامل

Fast Moving Window Algorithm for QR and Cholesky Decompositions

This paper proposes a fast moving window algorithm for QR and Cholesky decompositions by simultaneously applying data updating and downdating. The developed procedure is based on inner products and entails a similar downdating to that of the Chambers’ approach. For adding and deleting one row of data from the original matrix, a detailed analysis shows that the proposed algorithm outperforms exi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics: Conference Series

سال: 2020

ISSN: 1742-6588,1742-6596

DOI: 10.1088/1742-6596/1487/1/012023